Making Change and Finding Repfigits: Balancing a Knapsack
نویسنده
چکیده
We will discuss knapsack problems that arise in certain computational number theory settings. A common theme is that the search space for the standard real relaxation is large; in a sense this translates to a poor choice of variables. Lattice reduction methods have been developed in the past few years to improve handling of such problems. We show explicitly how they may be applied to computation of Frobenius instances, Keith numbers (also called "repfigits"), and as a first step in computation of Frobenius numbers.
منابع مشابه
Lattice Reduction, Integer Programming, and Knapsacks
We will discuss knapsack problems that arise in certain computa− tional number theory settings. A common theme is that the search space for the standard real relaxation is large; in a sense this trans− lates to a poor choice of variables. Lattice reduction methods have been developed in the past few years to improve handling of such problems. We show explicitly how they may be applied to comput...
متن کاملAPPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملAn employee transporting problem
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It require...
متن کاملA New Balancing and Ranking Method based on Hesitant Fuzzy Sets for Solving Decision-making Problems under Uncertainty
The purpose of this paper is to extend a new balancing and ranking method to handle uncertainty for a multiple attribute analysis under a hesitant fuzzy environment. The presented hesitant fuzzy balancing and ranking (HF-BR) method does not require attributes’ weights through the process of multiple attribute decision making (MADM) under hesitant conditions. For the rating of possible alternati...
متن کاملOptimality of Distributed Grid Intelligence for Power Distribution
The load balancing algorithm used for the Future Renewable Electric Energy Delivery and Management (FREEDM) System power migration is analyzed for optimality. The discussion includes reduction from the bin packing problem, and limitations of this approach. Additionally, the discussion shows a reduction from the fractional knapsack problem, which allows for optimization based upon minimum cost o...
متن کامل